#include<iostream>
using namespace std;
const int N = 2010, mod = 998244353;
int f[N][N];
int n, m, k;
int main()
{
	cin >> n >> m >> k;
	f[1][0] = m;
	for (int i = 2; i <= n; i++) {
		for (int j = 0; j <= k && j < i; j++) {
			f[i][j] = f[i - 1][j];
			if (j) {
				f[i][j] = (f[i][j] + f[i - 1][j - 1] * (m - 1ll)) % mod;
			}
		}
	}
	cout << f[n][k] << endl;
	return 0;
}